Pentavalent symmetric graphs admitting vertex-transitive non-abelian simple groups
نویسندگان
چکیده
منابع مشابه
Pentavalent symmetric graphs admitting transitive non-abelian characteristically simple groups
Let Γ be a graph and let G be a group of automorphisms of Γ. The graph Γ is called G-normal if G is normal in the automorphism group of Γ. Let T be a finite non-abelian simple group and let G = T l with l ≥ 1. In this paper we prove that if every connected pentavalent symmetric T -vertex-transitive graph is T -normal, then every connected pentavalent symmetric G-vertex-transitive graph is G-nor...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملFinite Transitive Permutation Groups and Finite Vertex-Transitive Graphs
The theory of vertex-transitive graphs has developed in parallel with the theory of transitive permutation groups. In this chapter we explore some of the ways the two theories have influenced each other. On the one hand each finite transitive permutation group corresponds to several vertex-transitive graphs, namely the generalised orbital graphs which we shall discuss below. On the other hand, ...
متن کاملNormal edge-transitive Cayley graphs on the non-abelian groups of order $4p^2$, where $p$ is a prime number
In this paper, we determine all of connected normal edge-transitive Cayley graphs on non-abelian groups with order $4p^2$, where $p$ is a prime number.
متن کاملDistance Transitive Graphs and Finite Simple Groups
This paper represents the first step in the classification of finite primitive distance transitive graphs. In it we reduce the problem to the case where the automorphism group is either almost simple or affine. Let ^ be a simple, connected, undirected graph with vertex set Q. If oc, /? e Q, then d(a, j8) denotes the distance between a and /3 in §. Let G be some group of automorphisms of §. Then...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2017
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2017.03.007